package LeetCode;

public class LC_605_CanPlaceFlowers{

    public static void main(String[] args) {

    }

    public class Solution {
        public boolean canPlaceFlowers(int[] flowerbed, int n) {
            int i = 0, count = 0;
            while (i < flowerbed.length) {
                if (flowerbed[i] == 0 && (i == 0 || flowerbed[i - 1] == 0) && (i == flowerbed.length - 1 || flowerbed[i + 1] == 0)) {
                    flowerbed[i] = 1;
                    count++;
                }
                i++;
            }
            return count >= n;
        }
    }

}